Eigenvalues and Eigenvectors of the Discrete Laplacian

نویسنده

  • Bryan C. Smith
چکیده

We derive explicit formulas for the eigenvalues and eigenvectors of the Discrete Laplacian on a rectangular grid for the standard finite difference and finite element methods in 1D, 2D, and 3D. Periodic, Dirichlet, Neumann, and mixed boundary conditions are all considered. We show how the higher dimensional operators can be written as sums of tensor products of one dimensional operators, and their eigenvectors can be written as tensor products of one dimensional vectors. We also refer the reader to laplacian.m, open source Matlab code for constructing discrete laplacian matrices along with their eigenvalues and eigenvectors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph

In this paper, we show that the eigenvectors associated with the zero eigenvalues of the Laplacian and signless Lapacian tensors of a k-uniform hypergraph are closely related to some configured components of that hypergraph. We show that the components of an eigenvector associated with the zero eigenvalue of the Laplacian or signless Lapacian tensor have the same modulus. Moreover, under a cano...

متن کامل

Spectral convergence of the connection Laplacian from random samples

Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as DiffusionMaps and Laplacian Eigenmaps, are often used for manifold learning and nonlinear dimensionality reduction. It was previously shown by Belkin&Niyogi (2007, Convergence of Laplacian eigenmaps, vol. 19. Proceedings of the 2006 Conference on Advances in Neural Information Processing System...

متن کامل

Convergence of Laplacian spectra from random samples

Eigenvectors and eigenvalues of discrete graph Laplacians are often used for manifold learning and nonlinear dimensionality reduction. It was previously proved by Belkin and Niyogi [3] that the eigenvectors and eigenvalues of the graph Laplacian converge to the eigenfunctions and eigenvalues of the Laplace-Beltrami operator of the manifold in the limit of infinitely many data points sampled ind...

متن کامل

H-eigenvalues of Laplacian and Signless Laplacian Tensors

We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H-eigenvalues, i.e., H-eigenvalues with positive H-eigenvectors. We show that each of the Laplacian tensor, the signless Laplacian tensor, and the adjacency tensor has at most one H-eigenva...

متن کامل

Seidel Signless Laplacian Energy of Graphs

Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012